Primitive normal values of rational functions over finite fields
نویسندگان
چکیده
In this paper, we consider rational functions [Formula: see text] with some minor restrictions over the finite field where for prime and positive integer text]. We establish a sufficient condition existence of pair primitive normal elements in Moreover, quadratic numerators denominators, explicitly find that there are at most fields which such may not exist.
منابع مشابه
Normal bases and primitive elements over finite fields
Let q be a prime power, m ≥ 2 an integer and A = ( a b c d ) ∈ GL2(Fq), where A 6= ( 1 1 0 1 ) if q = 2 and m is odd. We prove an extension of the primitive normal basis theorem and its strong version. Namely, we show that, except for an explicit small list of genuine exceptions, for every q, m and A, there exists some primitive x ∈ Fqm such that both x and (ax+b)/(cx+d) produce a normal basis ...
متن کاملThe Art of Iterating Rational Functions over Finite Fields
The field of complex dynamical systems generated by iteration of polynomials and rational functions is a classical area of mathematics with a rich history and a wide variety of results. Recently, there has been substantial interest in arithmetical dynamical systems (ADS), meaning the iteration of rational functions over fields of number-theoretic interest. Although isolated results regarding AD...
متن کاملSpecial Values of Hypergeometric Functions over Finite Fields
For an odd prime p, define Hp(z) = ∑ u,v(mod p) ( uv(1−u)(1−v)(1−uvz) p ) , where z is an integer (mod p) and the summands are Legendre symbols. The function Hp(z) was explicitly evaluated for z = 1 by Evans (1981) and for z = −1 by Greene and Stanton (1986). Koike (1992) determined Hp(1/4)(mod p), and Ono (1998) evaluated Hp(z) for z = 1/4,−1/8, and 1/64. This paper evaluates Hp(z) for infinit...
متن کاملSearch of Primitive Polynomials over Finite Fields
Let us introduce some notations and definitions: if p denotes a prime integer and n a positive integer, then GF(p”) is the field containing pn elements. a primitive element of GF(p”) is a generator of the cyclic multiplicative group GVP”)*, a manic irreducible polynomial of degree n belonging to GF(p)[X] is called primitive if its roots are primitive elements of GF(p”). These polynomials are in...
متن کاملNilpotent Primitive Linear Groups over Finite Fields
In this paper we investigate the structure of groups as in the title. Our work builds on work of several other authors, namely Konyuh [5], Leedham-Green and Plesken [6], and Zalesskii [10], who have described the abstract isomorphism types of the groups. We obtain more detailed descriptions, in particular explaining how group structure depends on the existence of an abelian primitive subgroup. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra and Its Applications
سال: 2022
ISSN: ['1793-6829', '0219-4988']
DOI: https://doi.org/10.1142/s0219498823501529